1 Hempel ’ s ( Rather Odd ) Reconstruction of Nicod
نویسنده
چکیده
Hempel offers a precise, logical reconstruction of Nicod’s naïve instantial account. There are several peculiar features of Hempel’s reconstruction of Nicod. I will focus presently on two such features. First, Hempel’s reconstruction is completely non-probabilistic (we’ll return to that unfortunate decision on Hempel’s part later). Second, Hempel’s reconstruction takes the relata of Nicod’s confirmation relation to be objects and universal statements, as opposed to singular statements and universal statements. In modern (first-order) parlance, Hempel’s reconstruction of Nicod seems to be something like the following principle:
منابع مشابه
A Historical Introduction to Confirmation Theory
By “is (un)favorable to”, Nicod meant “raises (lowers) the inductive probability of”. Here, Nicod has in mind Keynesian inductive probability (more on that later). While Nicod is not very clear on the logical details (stay tuned for Hempel!), some things are clear in what he says: Instantial confirmation is a relation between singular and general propositions/statements (“facts” and “laws”). ±C...
متن کاملGoodman's "New Riddle"
First, a brief historical trace of the developments in confirmation theory leading up to Goodman’s infamous “grue” paradox is presented. Then, Goodman’s argument is analyzed from both Hempelian and Bayesian perspectives. A guiding analogy is drawn between certain arguments against classical deductive logic, and Goodman’s “grue” argument against classical inductive logic. The upshot of this anal...
متن کاملThe Paradox of Confirmation 1
Hempel first introduced the paradox of confirmation in 1937. Since then, a very extensive literature on the paradox has evolved (Vranas 2004). Much of this literature can be seen as responding to Hempel’s subsequent discussions and analyses of the paradox (Hempel 1945). Recently, it was noted that Hempel’s intuitive (and plausible) resolution of the paradox was inconsistent with his official th...
متن کاملHow Bayesian Confirmation Theory Handles the Paradox of the Ravens
The Paradox of the Ravens (a.k.a,, The Paradox of Confirmation) is indeed an old chestnut. A great many things have been written and said about this paradox and its implications for the logic of evidential support. The first part of this paper will provide a brief survey of the early history of the paradox. This will include the original formulation of the paradox and the early responses of Hem...
متن کاملQuery Order
We study the effect of query order on computational power, and show that Pj k—the languages computable via a polynomial-time machine given one query to the jth level of the boolean hierarchy followed by one query to the kth level of the boolean hierarchy—equals Rpj+2k−1-tt(NP) if j is even and k is odd, and equals Rpj+2k-tt(NP) otherwise. Thus, unless the polynomial hierarchy collapses, it hold...
متن کامل